NP-complete scheduling problems

Complete Problems for Monotone NP

We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...

NP-Complete Stable Matching Problems

This paper concerns the complexity analysis of the roommate problem and intern assignment problem with couples. These are two special cases of the matching problems known as stable matching. The roommate problem is that of assigning a set of people to rooms of exactly two occupants in accordance with the preferences of the members of the set. The intern assignment problem with couples is that o...

Lecture 16: NP-complete Problems

Robotic Owshop Scheduling Is Strongly Np-complete

We consider a robotic owshop model in which a single robot is responsible for the transportation of parts between machines and the amount of time that a part spends on a machine must be comprised in some prede ned interval. The objective is to nd a feasible schedule with minimal cycle time. Many researchers have proposed nonpolynomial solution methods for a variety of closely related robotic ow...

Neural Networks for Np-complete Problems

combinatorial optimization is an active field of research in Neural Networks. Since the first attempts to solve the travelling salesman problem with Hopfield nets several progresses have been made. I will present some Neural Network approximate solutions for NP-complete problems that have a sound mathematical foundation and that, beside their theoretical interest, are also numerically encouragi...